Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
نویسندگان
چکیده
An (n, c, `, r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of `-bit packets of total length cn from an n-bit message. The decoding algorithm is able to recover the message from any set of packets whose total length is r, i.e., from any set of r/` packets. We describe erasure codes where both the encoding and decoding algorithms run in linear time and where r is only slightly larger than n.
منابع مشابه
Linear Time Erasure Codes With Nearly Optimal Recovery
An (n; c; `; r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of`-bit packets of total length cn from an n-bit message. The decoding algorithm is able to recover the message from any set of packets whose total length is r, i.e., from any set of r=`packets. We describe erasure codes where both the enco...
متن کاملLinear Time Probabilistic Erasure Codes With Nearly Optimal Recovery
We present a linear time probabilistic erasure code with the following properties. The encoding algorithm produces cn letters from an n letter message. The decoding algorithm is able with high probability to reconstruct the message from any set of (1+ ǫ)n letters. Alon and Luby [5, 6] simultaneously developed a deterministic version but their running time is O(ǫ−4n) instead of our O(ǫ−1 ln(ǫ)n)...
متن کاملRate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures
Recovery of data packets from packet erasures in a timely manner is critical for many streaming applications. An early paper by Martinian and Sundberg introduced a framework for streaming codes and designed rate-optimal codes that permit delay-constrained recovery from an erasure burst of length up to B. A recent work by Badr et al. extended this result and introduced a sliding-window channel m...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملOn the Speedup of Recovery in Large - Scale Erasure - Coded Storage Systems ( Supplementary File )
Our work focuses on the recovery solutions for XORbased erasure codes. We point out that regenerating codes [5] have recently been proposed to minimize the recovery bandwidth in distributed storage systems. The idea is that surviving storage nodes compute and transmit linear combinations of their stored data during failure recovery. On the other hand, in XOR-based erasure codes, we do not requi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995